New-HOPLA: A Higher-order Process Language with Name Generation

نویسندگان

  • Glynn Winskel
  • Francesco Zappa Nardelli
چکیده

This paper introduces new-HOPLA, a concise but powerful language for higher-order nondeterministic processes with name generation. Its origins as a metalan-guage for domain theory are sketched but for the most part the paper concentrateson its operational semantics. The language is typed, the type of a process describingthe shape of the computation paths it can perform. Its transition semantics, bisim-ulation, congruence properties and expressive power are explored. Encodings aregiven of well-known process algebras, including π-calculus, Higher-Order π-calculusand Mobile Ambients. 1 The origins of new-HOPLA This work is part of a general programme (reported in [8]), to develop a domain theorywhich scales up to the intricate languages, models and reasoning techniques used indistributed computation. This ambition led to a concentration on path based models,and initially on presheaf models because they can even encompass causal dependencymodels like event structures; so ‘domains’ is being understood more broadly than usual,to include presheaf categories.The general methodology has been to develop domain theories with a rich enoughlife of their own to suggest powerful metalanguages. The point to emphasise is that inthis way informative domain theories can have a pro-active role; they can yield new met-alanguages, by their nature very expressive, accompanied by novel ways to deconstructexisting notions into more primitive ones, as well as new analysis techniques. A feature ofpresheaf models has been very useful: in key cases there is often a strong correspondencebetween elements of the presheaf denotation and derivations in an operational semantics.In the cases of HOPLA and new-HOPLA the presheaf models have led not only the coreoperations of the language, and a suitable syntax, but also to their operational semantics.This paper reports on new-HOPLA, a compact but expressive language for higher-order nondeterministic processes with name generation. It extends the language HOPLA

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nominal domain theory for concurrency

This paper investigates a methodology of using FM (FraenkelMostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a domain theory for concurrency within FM sets the domain theory inherits types and operations for name generation, essentially without disturbing its original higherorder features. The original domain theory had a metalan...

متن کامل

Domain theory for concurrency

Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey. A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices of c...

متن کامل

Full Abstraction for HOPLA

A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation. The semantics is a clean, domain-theoretic description of processes as downwards-closed sets of computation paths: the operations of HOPLA arise as syntactic encodings of canonical constructions on such sets...

متن کامل

HOPLA-A Higher-Order Process Language

A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends itself to a more operational account. The language can be viewed as an extension of the lambda calculus with a “prefixed sum”, in which types express the form of computation path of which a process is capable....

متن کامل

Topics in Concurrency Lecture Notes

ions in parallel with processes: F |P = λx ((F x)|P ). Concretions in parallel with processes: C|P = (fst C, (snd C)|P ). The remaining cases are given symmetrically. Processes P , Q of type P will—up to bisimilarity—be sums of prefixed terms, and by Proposition 8.7, their parallel composition satisfies the obvious expansion law. Ambient creation can be defined recursively in the higher-order l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004